On the Connection Between Ritt Characteristic Sets and Buchberger-Gröbner Bases
نویسنده
چکیده
For any polynomial ideal I, let the minimal triangular set contained in the reduced Buchberger-Gröbner basis of I with respect to the purely lexicographical term order be called the W-characteristic set of I. In this paper, we establish a strong connection between Ritt’s characteristic sets and Buchberger’s Gröbner bases of polynomial ideals by showing that the W-characteristic set C of I is a Ritt characteristic set of I whenever C is an ascending set, and a Ritt characteristic set of I can always be computed from C with simple pseudo-division when C is regular. We also prove that under certain variable ordering, either the W-characteristic set of I is normal, or irregularity occurs for the jth, but not the (j+1)th, elimination ideal of I for some j. In the latter case, we provide explicit pseudo-divisibility relations, which lead to nontrivial factorizations of certain polynomials in the Buchberger-Gröbner basis and thus reveal the structure of such polynomials. The pseudo-divisibility relations may be used to devise an algorithm to decompose arbitrary polynomial sets into normal triangular sets based on BuchbergerGröbner bases computation.
منابع مشابه
Decomposition of polynomial sets into characteristic pairs
A characteristic pair is a pair (G, C) of polynomial sets in which G is a reduced lexicographic Gröbner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be decomposed algorithmically into finitely many characteristic pairs with associated zero relations, which provide representations for the zero set of P in term...
متن کاملGröbner Bases for Binomials with Parametric Exponents
We study the uniformity of Buchberger algorithms for computing Gröbner bases with respect to a natural number parameter k in the exponents of the input polynomials. The problem is motivated by positive results of T. Takahashi on special exponential parameter series of polynomial sets in singularity theory. For arbitrary input sets uniformity is in general impossible. By way of contrast we show ...
متن کاملComputational Tutorial on Gröbner bases embedding Sage in LaTeX with SageTEX
A comprehensive treatment of the theory of Gröbner bases is far beyond the scope of this tutorial. The reader is reffered to [1], [2], [3] for a more detailed discussion. Gröbner bases offers a powerful algorithmic criterion for the existence of solutions to a system of algebraic equations over algebraically closed fields. While the theory is rich and builds on the theory of Ideals and Varietie...
متن کاملMinimised Geometric Buchberger Algorithm for Integer Programming
Recently, various algebraic integer programming (IP) solvers have been proposed based on the theory of Gröbner bases. The main difficulty of these solvers is the size of the Gröbner bases generated. In algorithms proposed so far, large Gröbner bases are generated by either introducing additional variables or by considering the generic IP problem IPA,C . Some improvements have been proposed such...
متن کاملGröbner Bases in Orders of Algebraic Number Fields
In the 1960s Bruno Buchberger presented his first critical-pair-completion algorithm, now called Buchberger’s algorithm. Since then Gröbner bases have become a powerful tool in computational algebra and algebraic geometry. What is not as well known is that Buchberger (1985, 1987) has also shown a way of computing Gröbner bases in the integers. This is not as trivial as it may seem. In the polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics in Computer Science
دوره 10 شماره
صفحات -
تاریخ انتشار 2016